Adapting Language Models for Non-Parallel Author-Stylized Rewriting
نویسندگان
چکیده
منابع مشابه
Adapting Cross-Genre Author Profiling to Language and Corpus
This paper presents our approach to the Author Profiling (AP) task at PAN 2016. The task aims at identifying the author’s age and gender under crossgenre AP conditions in three languages: English, Spanish, and Dutch. Our preprocessing stage includes reducing non-textual features to their corresponding semantic classes. We exploit typed character n-grams, lexical features, and nontextual feature...
متن کاملAuthor Obfuscation using WordNet and Language Models
As almost all the successful author identification approaches are based on the word frequencies, the most obvious way to obfuscate a text is to distort those frequencies. In this paper we chose a subset of the most frequent words for an author and replace each one with one of their synonyms. In order to select the best synonym, we considered two measures: similarity of the original word and the...
متن کاملProgramming Models for Parallel Systems: The Programmer’s Perspective 1st Author
Until now the mainstream software development community has not had to deal with the challenges of concurrent or parallel programming. Concurrent programming has been confined to specialized domains with closed world assumptions e.g. operating system kernels. Parallel programming has been successfully performed in very specific domain e.g. scientific computing using highly skilled developers of...
متن کاملNon procedural language for parallel programs
Probably building non procedural languages is the most prospective way for parallel programming just because non procedural means no fixed way for execution. The article consists of 3 parts. In first part we consider formal systems for definition a named datasets and studying an expression power of different subclasses. In the second part we consider a complexity of algorithms of building sets ...
متن کاملA core language for rewriting
System S is a calculus providing the basic abstractions of term rewriting: matching and building terms, term traversal, combining computations and handling failure. The calculus forms a core language for implementation of a wide variety of rewriting languages, or more generally, languages for specifying tree transformations. In this paper we show how a conventional rewriting language based on c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i05.6433